منابع مشابه
The Generalized Schröder Theory
While the standard Catalan and Schröder theories both have been extensively studied, people have only begun to investigate higher dimensional versions of the Catalan number (see, say, the 1991 paper of Hilton and Pedersen, and the 1996 paper of Garsia and Haiman). In this paper, we study a yet more general case, the higher dimensional Schröder theory. We define m-Schröder paths, find the number...
متن کامل, Dominique Schröder , and
A functional credential allows a user to anony-mously prove possession of a set of attributes that fulfillsa certain policy. The policies are arbitrary polynomiallycomputable predicates that are evaluated over arbitraryattributes. The key feature of this primitive is the dele-gation of verification to third parties, called designatedverifiers. The delegation protects the...
متن کاملGeneralized Small Schröder Numbers
We study generalized small Schröder paths in the sense of arbitrary sizes of steps. A generalized small Schröder path is a generalized lattice path from (0, 0) to (2n, 0) with the step set of {(k, k), (l,−l), (2r, 0) | k, l, r ∈ P}, where P is the set of positive integers, which never goes below the x-axis, and with no horizontal steps at level 0. We find a bijection between 5-colored Dyck path...
متن کاملHipparchus, Plutarch, Schröder and Hough
1. Hipparchus and Plutarch. Plutarch was a Greek biographer and philosopher from Chaeronea, who was born before a.d. 50 and died after a.d. 120. He is best known for his Parallel Lives, which inspired such Renaissance writers as Montaigne, Shakespeare, Dryden, and Rousseau. His many other works have been gathered together under the name Moralia, \a collection of comparatively short treatises an...
متن کاملLoopless Generation of Schröder Trees
The well-known Schröder numbers have appeared in different combinatorial contexts, including Schröder trees and well-weighted binary trees. The only loopless algorithm for generating Schröder trees actually generated representations for their well-weighted binary tree counterparts. This paper presents the first loopless algorithms for directly generating Schröder tree representations. They use ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lettera Matematica
سال: 2014
ISSN: 2281-6917,2281-5937
DOI: 10.1007/s40329-014-0059-8